Implementing Cryptographic Pairings on Smartcards
نویسندگان
چکیده
Pairings on elliptic curves are fast coming of age as cryptographic primitives for deployment in new security applications, particularly in the context of implementations of Identity-Based Encryption (IBE). In this paper we describe the implementation of various pairings on a contemporary 32-bit smart-card, the Philips HiPerSmart, an instantiation of the MIPS-32 based SmartMIPS architecture. Three types of pairing are considered, first the standard Tate pairing on a nonsupersingular curve E(Fp), second the Ate pairing, also on a nonsupersingular curve E(Fp), and finally the ηT pairing on a supersingular curve E(F2m). We demonstrate that pairings can be calculated as efficiently as classic cryptographic primitives on this architecture, with a calculation time of as little as 0.15 seconds.
منابع مشابه
Improved Fault Attack Against Eta Pairing
In recent years, an increasing number of cryptographic protocols based on bilinear pairings have been developed. With the enhancement of implementation efficiency, the algorithms of pairings are usually embedded in identity aware devices such as smartcards. Although many fault attacks and countermeasures for public key and elliptic curve cryptographic systems are known, the security of pairing ...
متن کاملImplementing cryptographic pairings: a magma tutorial
In this paper we show an efficient implementation of the Tate, ate and R-ate pairings in magma. This will be demonstrated by using the KSS curves with embedding degree k = 18.
متن کاملHow Smartcards Helped to Solve a Cryptographic Paradox
The use of smartcards allows for interesting properties of security protocols and services. In this paper we present an example of application of smartcards within the eld of electronic voting schemes. To be concrete, the use of smartcards has helped us to develop the rst electronic voting protocol which simultaneously satisses three properties apparently contradictory: uncoercibility, veriiabi...
متن کاملAlgorithmes et arithmétique pour l'implémentation de couplages cryptographiques
Pairings are cryptographic primitives which are now used in numerousprotocols. Computing and implementing them efficiently is then an interestingchallenge relying on an algorithmic and arithmetic study of those mathematicalfunctions.More precisely, pairings are bilinear maps defined over elliptic and hyperellipticcurves. Among those, we restrict our study to supersingular cu...
متن کاملAgent Platform for Wireless Sensor Network with Support for Cryptographic Protocols
This paper deals with a description of wireless sensor networks at the beginning. Further follows the introduction to the agent platform suitable for wireless networks. Mobile code and sensor networks suffer from considerable security problems. Our proposal of countermeasure is based on combination of smartcards with sensor nodes. Smartcards as a tamper resistant devices offer solution for the ...
متن کامل